V1: A Visual Query Language for Property Graphs

نویسنده

  • Lior Kogan
چکیده

V1‡ is a declarative visual query language for schema-based property graphs. V1 supports property graphs with mixed (both directed and undirected) edges and half-edges, with multivalued and composite properties, and with empty property values. V1 supports temporal data types, operators, and functions, and can be extended to support additional data types, operators, and functions (one spatiotemporal model is presented). V1 is generic, concise, has rich expressive power, and is highly receptive and productive.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Benchmarks for SPARQL Property Paths Bachelorarbeit

The Resource Description Framework (RDF) is a triple based representation of directed graphs with labelled edges. With the emergence of RDF graphs special databases, called RDF stores, were developed. In order to query graphs, which are stored in these RDF stores, the query language SPARQL Protocol And Query Language (SPARQL) is used. With the help of this query language it is possible to descr...

متن کامل

Developing a BIM-based Spatial Ontology for Semantic Querying of 3D Property Information

With the growing dominance of complex and multi-level urban structures, current cadastral systems, which are often developed based on 2D representations, are not capable of providing unambiguous spatial information about urban properties. Therefore, the concept of 3D cadastre is proposed to support 3D digital representation of land and properties and facilitate the communication of legal owners...

متن کامل

On the Query Complexity of Testing for Eulerian Orientations

We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be significantly harder for testing than other properties studied in the orientation model. We show a superconstant lower bound on the query complexity of 2-sided tests and a linear lower bound on the query complexity of ...

متن کامل

RUL: a Declarative Language for Updating RDF Data Master’s Thesis

Semantic Web applications are striving nowadays for managing changes of persistent resource descriptions created according to RDFS schemata. To cope with this demands, a declarative update language for RDF graphs is proposed, which is based on the paradigms of query and view languages RQL and RVL. This language, called RUL, ensures that the execution of the update primitives on nodes and arcs n...

متن کامل

Mapping SPARQL Query to temporal logic query based on NμSMV Model Checker to Query Semantic Graphs

The RDF (W3C standard for metamodeling) language is the most frequently used to represent the semantic graphs. This paper presents a new research combining different fields that are: the semantic web and the model checking. We developed a tool, RDF2NμSMV, which converts RDF graphs into NμSMV language. This conversion aims checking the semantic graphs that have numerous errors of interpretation ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1710.04470  شماره 

صفحات  -

تاریخ انتشار 2017